Object-specific Feature Extraction via Markov Random Fields Derived from 0-order Sigma-tree Segmentations

نویسندگان

  • Syed Irteza
  • Ali Khan
چکیده

Sigma-Trees associated with residual vector quantization (RVQ) has been used for image-driven data mining to detect features and objects in a digital image with a degree of success. RVQ methods based on σ-tree structures have been designed to implement successive refinement of information for image segmentation. In such implementations, RVQ based novel methods are devised for pixel-block mining, pattern similarity scoring, class label assignments and attribute mining (Barnes, 2007a). Direct sum σ-tree structures are used for near-neighbor similarity scoring. The variable bit-plane data representations produced by σ-tree structures not only provides an approach for image content segmentation and a structure for formulation of Bayesian classification, but also offers a solution to the challenge of high computational costs involved in pixel-block similarity searching. Such σ-tree based multi-stage RVQ classifiers have yielded promising image-content segmentation/classification yielding fine-grained features extraction. This ability to produce fine-grained features has been exploited in object detection applications. However, in the context of object identification the methods have been applied heuristically on single stages of the multi-stage σ-tree based direct sum successive refinement data representation. As a result, object detection with optimal rejection of false alarm is not guaranteed. Gibbs random field (GRF), also known as Markov random field (MRF), provides a joint probabilistic framework to model the object identification task in digital images. As a result, the image segmentation task can be solved optimally in the maximum aposteriori probabilistic (MAP) sense. Thus, the advantages of the σ-tree based RVQ classifier to provide fine-grained feature extractions for object of interest can be exploited with an MRF-based model of the object. This paper demonstrates the use of MRF on a 0 order output of the σ-tree based RVQ for the purpose of object detection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiscale Image Segmentation with a Dynamic Label Tree

Automatic information extraction from satellite images is the base of remote sensing image archives with contentbased query services. Pyramidal image models based on multiscale Markov random fields in combination with a texture model proved to yield good classification and segmentation results. The texture model is used for initial soft classification and then the optimal segmentation given the...

متن کامل

Gradient Tree Boosting for Training Conditional Random Fields

Conditional random fields (CRFs) provide a flexible and powerful model for sequence labeling problems. However, existing learning algorithms are slow, particularly in problems with large numbers of potential input features and feature combinations. This paper describes a new algorithm for training CRFs via gradient tree boosting. In tree boosting, the CRF potential functions are represented as ...

متن کامل

Ecient decoding with continuous rational kernels using the expectation semiring

Semi-Markov conditional randomelds are discriminativemodels that can be used for speech recognition. ey allow per-word (instead of per-frame) features. Since the segmentation into words is not known a priori, all possibilities must be considered. It is therefore important to consider the e›ciency of the feature extraction process. Features derived from generative models like hmms (log-likeliho...

متن کامل

Fisher Discriminant Analysis (FDA), a supervised feature reduction method in seismic object detection

Automatic processes on seismic data using pattern recognition is one of the interesting fields in geophysical data interpretation. One part is the seismic object detection using different supervised classification methods that finally has an output as a probability cube. Object detection process starts with generating a pickset of two classes labeled as object and non-object and then selecting ...

متن کامل

Bayesian selection of the neighbourhood order for Gauss-Markov texture models

9 Gauss–Markov random fields have been successfully used as texture models in a host of applications, ranging from 10 synthesis, feature extraction, classification and segmentation to query by image content and information retrieval in 11 large image databases. An issue that deserves special consideration is the selection of the neighbourhood order (model 12 complexity), which should faithfully...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010